By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 33, Issue 5, pp. 1011-1260

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Efficient Algorithms for Optimal Stream Merging for Media-on-Demand

Amotz Bar-Noy and Richard E. Ladner

pp. 1011-1034

BibTeX  Abstract Full Text:  PDF

Better Online Algorithms for Scheduling with Machine Cost

György Dósa and Yong He

pp. 1035-1051

BibTeX  Abstract Full Text:  PDF

Solving Equations in the Relational Algebra

Joachim Biskup, Jan Paredaens, Thomas Schwentick, and Jan Van den Bussche

pp. 1052-1066

BibTeX  Abstract Full Text:  PDF

Equivalences and Separations Between Quantum and Classical Learnability

Rocco A. Servedio and Steven J. Gortler

pp. 1067-1092

BibTeX  Abstract Full Text:  PDF

On the Hardness of Graph Isomorphism

Jacobo Torán

pp. 1093-1108

BibTeX  Abstract Full Text:  PDF

A Lambda Calculus for Quantum Computation

André van Tonder

pp. 1109-1135

BibTeX  Abstract Full Text:  PDF

Circumference of Graphs with Bounded Degree

Guantao Chen, Jun Xu, and Xingxing Yu

pp. 1136-1170

BibTeX  Abstract Full Text:  PDF

A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution

Nathan Segerlind, Sam Buss, and Russell Impagliazzo

pp. 1171-1200

BibTeX  Abstract Full Text:  PDF

Approximate Local Search in Combinatorial Optimization

James B. Orlin, Abraham P. Punnen, and Andreas S. Schulz

pp. 1201-1214

BibTeX  Abstract Full Text:  PDF

A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes

John Havlicek

pp. 1215-1222

BibTeX  Abstract Full Text:  PDF

Average-Case Performance of the Apriori Algorithm

Paul W. Purdom, Dirk Van Gucht, and Dennis P. Groth

pp. 1223-1260

BibTeX  Abstract Full Text:  PDF